Practical investigation of constraints with graph views
Identifieur interne :
000231 ( PascalFrancis/Corpus );
précédent :
000230;
suivant :
000232
Practical investigation of constraints with graph views
Auteurs : Tobias MüllerSource :
-
Lecture notes in computer science [ 0302-9743 ] ; 2000.
RBID : Pascal:01-0040926
Descripteurs français
English descriptors
Abstract
Combinatorial problems can be efficiently tackled with constraint programming systems. The main tasks of the development of a constraint-based application are modeling the problem at hand and subsequently implementing that model. Typically, erroneous behavior of a constraint-based application is caused by either the model or the implementation (or both of them). Current constraint programming systems provide limited debugging support for modeling and implementing a problem. This paper proposes the Constraint Investigator, an interactive tool for debugging the model and the implementation of a constraint-based application. In particular, the Investigator is targeted at problems like wrong, void, or partial solutions. A graph metaphor is used to reflect the constraints in the solver and to present them to the user. The paper shows that this metaphor is intuitive and proposes appraoches to deal with real-life problem sizes. The Investigator has been implemented in Mozart Oz and complements other constraint programming tools as an interactive visual search engine, forming the base for an integrated constraint debugging environment.
Notice en format standard (ISO 2709)
Pour connaître la documentation sur le format Inist Standard.
| pA |
| A01 | 01 | 1 | | @0 0302-9743 |
|---|
| A05 | | | | @2 1894 |
|---|
| A08 | 01 | 1 | ENG | @1 Practical investigation of constraints with graph views |
|---|
| A09 | 01 | 1 | ENG | @1 Principles and practice of constraint programming - CP 2000 : Singapore, 18-21 September 2000 |
|---|
| A11 | 01 | 1 | | @1 MÜLLER (Tobias) |
|---|
| A12 | 01 | 1 | | @1 DECHTER (Rina) @9 ed. |
|---|
| A14 | 01 | | | @1 Programming Systems Lab, Universität des Saarlandes, Postfach 15 11 50 @2 66041 Saarbrücken @3 DEU @Z 1 aut. |
|---|
| A20 | | | | @1 320-336 |
|---|
| A21 | | | | @1 2000 |
|---|
| A23 | 01 | | | @0 ENG |
|---|
| A26 | 01 | | | @0 3-540-41053-8 |
|---|
| A43 | 01 | | | @1 INIST @2 16343 @5 354000090097220240 |
|---|
| A44 | | | | @0 0000 @1 © 2001 INIST-CNRS. All rights reserved. |
|---|
| A45 | | | | @0 19 ref. |
|---|
| A47 | 01 | 1 | | @0 01-0040926 |
|---|
| A60 | | | | @1 P @2 C |
|---|
| A61 | | | | @0 A |
|---|
| A64 | 01 | 1 | | @0 Lecture notes in computer science |
|---|
| A66 | 01 | | | @0 DEU |
|---|
| A66 | 02 | | | @0 USA |
|---|
| C01 | 01 | | ENG | @0 Combinatorial problems can be efficiently tackled with constraint programming systems. The main tasks of the development of a constraint-based application are modeling the problem at hand and subsequently implementing that model. Typically, erroneous behavior of a constraint-based application is caused by either the model or the implementation (or both of them). Current constraint programming systems provide limited debugging support for modeling and implementing a problem. This paper proposes the Constraint Investigator, an interactive tool for debugging the model and the implementation of a constraint-based application. In particular, the Investigator is targeted at problems like wrong, void, or partial solutions. A graph metaphor is used to reflect the constraints in the solver and to present them to the user. The paper shows that this metaphor is intuitive and proposes appraoches to deal with real-life problem sizes. The Investigator has been implemented in Mozart Oz and complements other constraint programming tools as an interactive visual search engine, forming the base for an integrated constraint debugging environment. |
|---|
| C02 | 01 | X | | @0 001D02A05 |
|---|
| C02 | 02 | X | | @0 001D02A06 |
|---|
| C03 | 01 | X | FRE | @0 Optimisation combinatoire @5 04 |
|---|
| C03 | 01 | X | ENG | @0 Combinatorial optimization @5 04 |
|---|
| C03 | 01 | X | SPA | @0 Optimización combinatoria @5 04 |
|---|
| C03 | 02 | X | FRE | @0 Satisfaction contrainte @5 05 |
|---|
| C03 | 02 | X | ENG | @0 Constraint satisfaction @5 05 |
|---|
| C03 | 02 | X | SPA | @0 Satisfaccion restricción @5 05 |
|---|
| C03 | 03 | X | FRE | @0 Débogage @5 06 |
|---|
| C03 | 03 | X | ENG | @0 Debugging @5 06 |
|---|
| C03 | 03 | X | SPA | @0 Puesta a punto programa @5 06 |
|---|
| C03 | 04 | X | FRE | @0 Arbre graphe @5 07 |
|---|
| C03 | 04 | X | ENG | @0 Tree(graph) @5 07 |
|---|
| C03 | 04 | X | SPA | @0 Arbol grafo @5 07 |
|---|
| C03 | 05 | X | FRE | @0 Visualisation @5 08 |
|---|
| C03 | 05 | X | ENG | @0 Visualization @5 08 |
|---|
| C03 | 05 | X | SPA | @0 Visualización @5 08 |
|---|
| N21 | | | | @1 022 |
|---|
|
|---|
| pR |
| A30 | 01 | 1 | ENG | @1 International conference on principles and practice of constraint programming @2 6 @3 Singapore SGP @4 2000-09-18 |
|---|
|
|---|
Format Inist (serveur)
| NO : | PASCAL 01-0040926 INIST |
|---|
| ET : | Practical investigation of constraints with graph views |
|---|
| AU : | MÜLLER (Tobias); DECHTER (Rina) |
|---|
| AF : | Programming Systems Lab, Universität des Saarlandes, Postfach 15 11 50/66041 Saarbrücken/Allemagne (1 aut.) |
|---|
| DT : | Publication en série; Congrès; Niveau analytique |
|---|
| SO : | Lecture notes in computer science; ISSN 0302-9743; Allemagne; Da. 2000; Vol. 1894; Pp. 320-336; Bibl. 19 ref. |
|---|
| LA : | Anglais |
|---|
| EA : | Combinatorial problems can be efficiently tackled with constraint programming systems. The main tasks of the development of a constraint-based application are modeling the problem at hand and subsequently implementing that model. Typically, erroneous behavior of a constraint-based application is caused by either the model or the implementation (or both of them). Current constraint programming systems provide limited debugging support for modeling and implementing a problem. This paper proposes the Constraint Investigator, an interactive tool for debugging the model and the implementation of a constraint-based application. In particular, the Investigator is targeted at problems like wrong, void, or partial solutions. A graph metaphor is used to reflect the constraints in the solver and to present them to the user. The paper shows that this metaphor is intuitive and proposes appraoches to deal with real-life problem sizes. The Investigator has been implemented in Mozart Oz and complements other constraint programming tools as an interactive visual search engine, forming the base for an integrated constraint debugging environment. |
|---|
| CC : | 001D02A05; 001D02A06 |
|---|
| FD : | Optimisation combinatoire; Satisfaction contrainte; Débogage; Arbre graphe; Visualisation |
|---|
| ED : | Combinatorial optimization; Constraint satisfaction; Debugging; Tree(graph); Visualization |
|---|
| SD : | Optimización combinatoria; Satisfaccion restricción; Puesta a punto programa; Arbol grafo; Visualización |
|---|
| LO : | INIST-16343.354000090097220240 |
|---|
| ID : | 01-0040926 |
|---|
Links to Exploration step
Pascal:01-0040926
Le document en format XML
<record><TEI><teiHeader><fileDesc><titleStmt><title xml:lang="en" level="a">Practical investigation of constraints with graph views</title>
<author><name sortKey="Muller, Tobias" sort="Muller, Tobias" uniqKey="Muller T" first="Tobias" last="Müller">Tobias Müller</name>
<affiliation><inist:fA14 i1="01"><s1>Programming Systems Lab, Universität des Saarlandes, Postfach 15 11 50</s1>
<s2>66041 Saarbrücken</s2>
<s3>DEU</s3>
<sZ>1 aut.</sZ>
</inist:fA14><publicationStmt><idno type="wicri:source">INIST</idno>
<idno type="inist">01-0040926</idno>
<date when="2000">2000</date>
<idno type="stanalyst">PASCAL 01-0040926 INIST</idno>
<idno type="RBID">Pascal:01-0040926</idno>
<idno type="wicri:Area/PascalFrancis/Corpus">000231</idno>
</publicationStmt><sourceDesc><biblStruct><analytic><title xml:lang="en" level="a">Practical investigation of constraints with graph views</title>
<author><name sortKey="Muller, Tobias" sort="Muller, Tobias" uniqKey="Muller T" first="Tobias" last="Müller">Tobias Müller</name>
<affiliation><inist:fA14 i1="01"><s1>Programming Systems Lab, Universität des Saarlandes, Postfach 15 11 50</s1>
<s2>66041 Saarbrücken</s2>
<s3>DEU</s3>
<sZ>1 aut.</sZ>
</inist:fA14><series><title level="j" type="main">Lecture notes in computer science</title>
<idno type="ISSN">0302-9743</idno>
<imprint><date when="2000">2000</date>
</imprint><seriesStmt><title level="j" type="main">Lecture notes in computer science</title>
<idno type="ISSN">0302-9743</idno>
</seriesStmt><profileDesc><textClass><keywords scheme="KwdEn" xml:lang="en"><term>Combinatorial optimization</term>
<term>Constraint satisfaction</term>
<term>Debugging</term>
<term>Tree(graph)</term>
<term>Visualization</term>
</keywords><keywords scheme="Pascal" xml:lang="fr"><term>Optimisation combinatoire</term>
<term>Satisfaction contrainte</term>
<term>Débogage</term>
<term>Arbre graphe</term>
<term>Visualisation</term>
</keywords><front><div type="abstract" xml:lang="en">Combinatorial problems can be efficiently tackled with constraint programming systems. The main tasks of the development of a constraint-based application are modeling the problem at hand and subsequently implementing that model. Typically, erroneous behavior of a constraint-based application is caused by either the model or the implementation (or both of them). Current constraint programming systems provide limited debugging support for modeling and implementing a problem. This paper proposes the Constraint Investigator, an interactive tool for debugging the model and the implementation of a constraint-based application. In particular, the Investigator is targeted at problems like wrong, void, or partial solutions. A graph metaphor is used to reflect the constraints in the solver and to present them to the user. The paper shows that this metaphor is intuitive and proposes appraoches to deal with real-life problem sizes. The Investigator has been implemented in Mozart Oz and complements other constraint programming tools as an interactive visual search engine, forming the base for an integrated constraint debugging environment.</div>
</front><inist><standard h6="B"><pA><fA01 i1="01" i2="1"><s0>0302-9743</s0>
</fA01><fA05><s2>1894</s2>
</fA05><fA08 i1="01" i2="1" l="ENG"><s1>Practical investigation of constraints with graph views</s1>
</fA08><fA09 i1="01" i2="1" l="ENG"><s1>Principles and practice of constraint programming - CP 2000 : Singapore, 18-21 September 2000</s1>
</fA09><fA11 i1="01" i2="1"><s1>MÜLLER (Tobias)</s1>
</fA11><fA12 i1="01" i2="1"><s1>DECHTER (Rina)</s1>
<s9>ed.</s9>
</fA12><fA14 i1="01"><s1>Programming Systems Lab, Universität des Saarlandes, Postfach 15 11 50</s1>
<s2>66041 Saarbrücken</s2>
<s3>DEU</s3>
<sZ>1 aut.</sZ>
</fA14><fA20><s1>320-336</s1>
</fA20><fA21><s1>2000</s1>
</fA21><fA23 i1="01"><s0>ENG</s0>
</fA23><fA26 i1="01"><s0>3-540-41053-8</s0>
</fA26><fA43 i1="01"><s1>INIST</s1>
<s2>16343</s2>
<s5>354000090097220240</s5>
</fA43><fA44><s0>0000</s0>
<s1>© 2001 INIST-CNRS. All rights reserved.</s1>
</fA44><fA45><s0>19 ref.</s0>
</fA45><fA47 i1="01" i2="1"><s0>01-0040926</s0>
</fA47><fA60><s1>P</s1>
<s2>C</s2>
</fA60><fA64 i1="01" i2="1"><s0>Lecture notes in computer science</s0>
</fA64><fA66 i1="01"><s0>DEU</s0>
</fA66><fA66 i1="02"><s0>USA</s0>
</fA66><fC01 i1="01" l="ENG"><s0>Combinatorial problems can be efficiently tackled with constraint programming systems. The main tasks of the development of a constraint-based application are modeling the problem at hand and subsequently implementing that model. Typically, erroneous behavior of a constraint-based application is caused by either the model or the implementation (or both of them). Current constraint programming systems provide limited debugging support for modeling and implementing a problem. This paper proposes the Constraint Investigator, an interactive tool for debugging the model and the implementation of a constraint-based application. In particular, the Investigator is targeted at problems like wrong, void, or partial solutions. A graph metaphor is used to reflect the constraints in the solver and to present them to the user. The paper shows that this metaphor is intuitive and proposes appraoches to deal with real-life problem sizes. The Investigator has been implemented in Mozart Oz and complements other constraint programming tools as an interactive visual search engine, forming the base for an integrated constraint debugging environment.</s0>
</fC01><fC02 i1="01" i2="X"><s0>001D02A05</s0>
</fC02><fC02 i1="02" i2="X"><s0>001D02A06</s0>
</fC02><fC03 i1="01" i2="X" l="FRE"><s0>Optimisation combinatoire</s0>
<s5>04</s5>
</fC03><fC03 i1="01" i2="X" l="ENG"><s0>Combinatorial optimization</s0>
<s5>04</s5>
</fC03><fC03 i1="01" i2="X" l="SPA"><s0>Optimización combinatoria</s0>
<s5>04</s5>
</fC03><fC03 i1="02" i2="X" l="FRE"><s0>Satisfaction contrainte</s0>
<s5>05</s5>
</fC03><fC03 i1="02" i2="X" l="ENG"><s0>Constraint satisfaction</s0>
<s5>05</s5>
</fC03><fC03 i1="02" i2="X" l="SPA"><s0>Satisfaccion restricción</s0>
<s5>05</s5>
</fC03><fC03 i1="03" i2="X" l="FRE"><s0>Débogage</s0>
<s5>06</s5>
</fC03><fC03 i1="03" i2="X" l="ENG"><s0>Debugging</s0>
<s5>06</s5>
</fC03><fC03 i1="03" i2="X" l="SPA"><s0>Puesta a punto programa</s0>
<s5>06</s5>
</fC03><fC03 i1="04" i2="X" l="FRE"><s0>Arbre graphe</s0>
<s5>07</s5>
</fC03><fC03 i1="04" i2="X" l="ENG"><s0>Tree(graph)</s0>
<s5>07</s5>
</fC03><fC03 i1="04" i2="X" l="SPA"><s0>Arbol grafo</s0>
<s5>07</s5>
</fC03><fC03 i1="05" i2="X" l="FRE"><s0>Visualisation</s0>
<s5>08</s5>
</fC03><fC03 i1="05" i2="X" l="ENG"><s0>Visualization</s0>
<s5>08</s5>
</fC03><fC03 i1="05" i2="X" l="SPA"><s0>Visualización</s0>
<s5>08</s5>
</fC03><fN21><s1>022</s1>
</fN21><pR><fA30 i1="01" i2="1" l="ENG"><s1>International conference on principles and practice of constraint programming</s1>
<s2>6</s2>
<s3>Singapore SGP</s3>
<s4>2000-09-18</s4>
</fA30><server><NO>PASCAL 01-0040926 INIST</NO>
<ET>Practical investigation of constraints with graph views</ET>
<AU>MÜLLER (Tobias); DECHTER (Rina)</AU>
<AF>Programming Systems Lab, Universität des Saarlandes, Postfach 15 11 50/66041 Saarbrücken/Allemagne (1 aut.)</AF>
<DT>Publication en série; Congrès; Niveau analytique</DT>
<SO>Lecture notes in computer science; ISSN 0302-9743; Allemagne; Da. 2000; Vol. 1894; Pp. 320-336; Bibl. 19 ref.</SO>
<LA>Anglais</LA>
<EA>Combinatorial problems can be efficiently tackled with constraint programming systems. The main tasks of the development of a constraint-based application are modeling the problem at hand and subsequently implementing that model. Typically, erroneous behavior of a constraint-based application is caused by either the model or the implementation (or both of them). Current constraint programming systems provide limited debugging support for modeling and implementing a problem. This paper proposes the Constraint Investigator, an interactive tool for debugging the model and the implementation of a constraint-based application. In particular, the Investigator is targeted at problems like wrong, void, or partial solutions. A graph metaphor is used to reflect the constraints in the solver and to present them to the user. The paper shows that this metaphor is intuitive and proposes appraoches to deal with real-life problem sizes. The Investigator has been implemented in Mozart Oz and complements other constraint programming tools as an interactive visual search engine, forming the base for an integrated constraint debugging environment.</EA>
<CC>001D02A05; 001D02A06</CC>
<FD>Optimisation combinatoire; Satisfaction contrainte; Débogage; Arbre graphe; Visualisation</FD>
<ED>Combinatorial optimization; Constraint satisfaction; Debugging; Tree(graph); Visualization</ED>
<SD>Optimización combinatoria; Satisfaccion restricción; Puesta a punto programa; Arbol grafo; Visualización</SD>
<LO>INIST-16343.354000090097220240</LO>
<ID>01-0040926</ID>
</server>
Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Musique/explor/MozartV1/Data/PascalFrancis/Corpus
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 000231 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/PascalFrancis/Corpus/biblio.hfd -nk 000231 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/Musique
|area= MozartV1
|flux= PascalFrancis
|étape= Corpus
|type= RBID
|clé= Pascal:01-0040926
|texte= Practical investigation of constraints with graph views
}}
| This area was generated with Dilib version V0.6.20.
Data generation: Sun Apr 10 15:06:14 2016. Site generation: Tue Feb 7 15:40:35 2023 |  |
